Constraint Solving and Language Processing
نویسندگان
چکیده
We propose Abductive Concept Formation Grammars, a CHRmethodology for treating long distance dependencies by abducing themissing elements while relating the constituents that must be related.We discuss our ideas both from a classical analysis point of view, andfrom a property-grammar based perspective. We exemplify them throughrelative clauses first, and next through the more challenging case of nat-ural language coordination.
منابع مشابه
Knowledge Representation Interactive System for Symbolic Mathematics
We present schematic architecture for Internet based Knowledge Representation Interactive System which deals with mathematics story problem solving. The aim of this work is to develop an interactive system to accept mathematics story problem, process and give natural language answer. Our system uses propositional semantic network approach in natural language processing system with constraint so...
متن کاملFinite Set Constraints in Oz
We report on the extension of the concurrent constraint language Oz by constraints over finite sets of integers. Set constraints are an important addition to the constraint programming system Oz and are very employable in natural language processing and general problem solving. This extension profits much from its integration with the existing constraint systems over finite domains and feature ...
متن کاملasprin: Answer Set Programming with Preferences
Answer Set Programming (ASP) is a well established approach to declarative problem solving, combining a rich yet simple modeling language with high-performance solving capacities. In this talk we present asprin, a general, flexible and extensible framework for preferences in ASP. asprin is general and captures many of the existing approaches to preferences. It is flexible, because it allows for...
متن کاملConstraint Solving and Language Processing, First International Workshop, CSLP 2004, Roskilde, Denmark, September 1-3, 2004, Revised Selected and Invited Papers
Change your habit to hang or waste the time to only chat with your friends. It is done by your everyday, don't you feel bored? Now, we will show you the new habit that, actually it's a very old habit to do that can make your life more qualified. When feeling bored of always chatting with your friends all free time, you can find the book enPDF constraint solving and language processing first int...
متن کاملConstraint satisfaction for robust parsing of spoken language
The eliminative nature of Constraint Satisfaction over nite domains o ers an interesting potential for robustness in the parsing of spoken language. An approach is presented, which puts unusually ambitious demands on the design of the Constraint Satisfaction procedure by trying to combine preferential reasoning, dynamic scheduling, parallel processing and incremental constraint solving within a...
متن کاملIncremental Adaptation of Constraint Handling Rule Derivations ?
Constraint solving in dynamic environments requires an immediate adaptation of previously evaluated solutions of constraint satisfaction problems if these problems are changed. After a change, an adapted solution is preferred which is stable, i.e. as close as possible to the original solution. A wide range of incremental constraint solving methods for dynamic nite domain constraint satisfaction...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004